#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

struct stu
{
public:
    string name;    // 名字
    string skill;   // 技能
    long int ATK;   // 战力
    int id;         // 学号

public:
    stu() {}

    stu(string name, string skill, long int ATK , int id) : name(name), skill(skill), ATK(ATK) , id(id) {}
};

bool Func(stu val_1 , stu val_2)
{
    return val_1.ATK < val_2.ATK;
}


int main(int argc, char const *argv[])
{
    // 创建容器
    vector<stu> s1;
    s1.push_back(stu("唐三"     , "蓝银缠绕" ,  100 , 1));
    s1.push_back(stu("萧炎"     , "佛怒火莲"        ,  500 , 2));
    s1.push_back(stu("林动"     , "大荒囚天指"      ,  9000 , 3));
    s1.push_back(stu("牧尘"     , "灵阵,起!!!"      ,  9001 , 4));
    s1.push_back(stu("陈平安"   , "妈来!!!"         ,  109 , 5));
    s1.push_back(stu("荒天帝"   , "六道轮回"        , 99999  , 5));

    // 排序算法 sort

    sort(s1.begin() , s1.end() , Func);
    
    for (vector<stu>::iterator it = s1.begin() ; it != s1.end() ; it++)
    {
        stu temp = *it;
        cout << "姓名:" << temp.name << "\t技能:" << temp.skill << "\t\t战力:" << temp.ATK << "\t\t学号:" << temp.id << endl;
    }
    



    return 0;
}
